4 M ay 2 01 0 Direct observation of paramagnons in palladium
نویسندگان
چکیده
R. Doubble, S. M. Hayden, ∗ Pengcheng Dai, 3 H. A. Mook, J. R. Thompson, 3 and C. D. Frost H.H. Wills Physics Laboratory, University of Bristol, Tyndall Ave., Bristol, BS8 1TL, UK Department of Physics and Astronomy, The University of Tennessee, Knoxville, Tennessee 37996-1200, USA Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831, UK ISIS Facility, Rutherford Appleton Laboratory, Chilton, Didcot, Oxfordshire OX11 0QX, UK
منابع مشابه
Selection and identification of physical parameters from passive observation. Application to a winding process
This paper deals with parameter selection and estimation of large and complex simulation models. This estimation problem is addressed in the case of passive observation, i.e. when no controlled experiment is possible. Given the lack of information in the data, an appropriate methodology is proposed to select and estimate some physical parameters of the model. Its implementation is based on a ne...
متن کامل. pl as m - p h ] 1 4 M ay 2 00 5 Two - fluid tokamak equilibria with reversed magnetic shear and sheared flow 1
X iv :p hy si cs /0 50 51 01 v1 [ ph ys ic s. pl as m -p h] 1 4 M ay 2 00 5 Two-fluid tokamak equilibria with reversed magnetic shear and sheared flow 1 G. Poulipoulis, G. N. Throumoulopoulos, H. Tasso University of Ioannina, Association Euratom Hellenic Republic, Section of Theoretical Physics, GR 451 10 Ioannina, Greece Max-Planck-Institut für Plasmaphysik, Euratom Association, D-85748 Garchi...
متن کاملar X iv : 1 70 5 . 03 17 4 v 1 [ m at h . R T ] 9 M ay 2 01 7 PYRAMIDS AND 2 - REPRESENTATIONS
We describe a diagrammatic procedure which lifts strict monoidal actions from additive categories to categories of complexes avoiding any use of direct sums. As an application, we prove that every simple transitive 2-representation of the 2-category of projective bimodules over a finite dimensional algebra is equivalent to a cell 2-representation.
متن کاملDelaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time
We propose a new algorithm that preprocess a set of n disjoint unit disks to be able to compute the Delaunay triangulation in O(n) expected time. Conversely to previous similar results, our algorithm is actually faster than a direct computation in O(n log n) time. Key-words: Delaunay triangulation, uncertainties, randomization This work is partly supported by ANR grant Triangles (ANR-07-BLAN-03...
متن کاملOn memory in exponentially expanding spaces
We examine the degree to which fluctuating dynamics on exponentially expanding spaces remember initial conditions. In de Sitter space, the global late-time configuration of a free scalar field always contains information about early fluctuations. By contrast, fluctuations near the boundary of Euclidean Anti-de Sitter may or may not remember conditions in the center, with a transition at ∆ = d/2...
متن کامل